Parallel Predictor-Corrector Interior-Point Algorithm of Structured Optimization Problems
نویسندگان
چکیده
Automated inspection of Printed Circuit Boards(PCB's) is essential if 100% repeatible inspection is to be carried out. The cost of most commercially available systems for automatic visual inspection of PCB's are beyond the reach of many small to medium manufacturers. The principle objectives of our research is to develop and integrate a micro-computer based image analysis system specifically for these manufacturers. The feasiblility of using a low-cost hardware system is under investigation, while efficient inspection techniques based on software are being developed in the Robotics and Automation Laboratory(RA L) at the University of Toronto.
منابع مشابه
Corrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملA Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
It is well known that the so-called first-order predictor-corrector methods working in a large neighborhood of the central path are among the most efficient interior-point methods (IPMs) for linear optimization (LO) problems. However, the best known iteration complexity of this type of methods is O (
متن کاملA Mehrotra-Type Predictor-Corrector Algorithm for P∗(κ) Linear Complementarity Problems
Mehrotra-type predictor-corrector algorithm, as one of most efficient interior point methods, has become the backbones of most optimization packages. Salahi et al. proposed a cut strategy based algorithm for linear optimization that enjoyed polynomial complexity and maintained its efficiency in practice. We extend their algorithm to P∗(κ) linear complementarity problems. The way of choosing cor...
متن کاملCorrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
A higher order corrector-predictor interior-point method is proposed for solving sufficient linear complementarity problems. The algorithm produces a sequence of iterates in the N− ∞ neighborhood of the central path. The algorithm does not depend on the handicap κ of the problem. It has O((1 + κ) √ nL) iteration complexity and is superlinearly convergent even for degenerate problems.
متن کاملComputational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algorithms work by solving a sequence of linear programming relaxations of the integer programming problem, and they use the simplex algorithm to solve the relaxations. In this paper, we describe experiments using a predicto...
متن کامل